Angle-Restricted Steiner Arborescences for Flow Map Layout
نویسندگان
چکیده
منابع مشابه
Three Evolutionary Codings of Rectilinear Steiner Arborescences
A rectilinear Steiner arborescence connects points in the Euclidean plane’s first quadrant and the origin with directed rectilinear edges from the origin up and to the right. The search for arborescences of minimum total length is NP-hard and finds applications in VLSI design. A greedy heuristic for this problem often returns near-optimum arborescences. Three genetic algorithms encode candidate...
متن کاملReachability-based matroid-restricted packing of arborescences
The fundamental result of Edmonds [5] started the area of packing arborescences and the great number of recent results shows increasing interest of this subject. Two types of matroid constraints were added to the problem in [2, 3, 9], here we show that both contraints can be added simultaneously. This way we provide a solution to a common generalization of the reachability-based packing of arbo...
متن کاملPreprocessing Steiner problems from VLSI layout
VLSI layout applications yield instances of the Steiner tree problem over grid graphs with holes, which are considered hard to be solved by current methods. In particular, preprocessing techniques developed for Steiner problems over general graphs are not likely to reduce signiicantly such VLSI instances. We propose a new preprocessing procedure, combining earlier ideas from the literature to m...
متن کاملPath Simplification for Metro Map Layout
We investigate the problem of creating simplified representations of polygonal paths. Specifically, we look at a path simplification problem in which line segments of a simplification are required to conform with a restricted set of directions C. An algorithm is given to compute such simplified paths in O(|C|n) time, where n is the number of vertices in the original path. This result is extende...
متن کاملStatistical Alignment via k-Restricted Steiner Trees
When relating a set of sequences by a phylogeny, we are essentially constructing a Steiner tree connecting the sequences in the space of all finite sequences. Finding an optimal Steiner tree is in most formulations hard, so population genetics and phylogenetics have often used spanning trees as an approximation for computational expediency. In this assessment you will be asked to investigate an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2014
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-013-9867-z